Expressing graph algorithms using generalized active messages
نویسندگان
چکیده
منابع مشابه
Active Messages Using Selective Interrupts without Polling
Active Messages form a user-level communication mechanism that allows a message to extract itself from the network upon arrival at its destination. Delivery of such a message can be realized via an interrupt-driven or a polling-based approach. This paper proposes a new mechanism, Active Messages Using Selective Interrupts Without Polling (AM_SIWOP). It improves upon Active Messages by reducing ...
متن کاملUsing Graph Transformation Algorithms to Generate Natural Language Equivalents of Icons Expressing Medical Concepts
A graphical language addresses the need to communicate medical information in a synthetic way. Medical concepts are expressed by icons conveying fast visual information about patients’ current state or about the known effects of drugs. In order to increase the visual language’s acceptance and usability, a natural language generation interface is currently developed. In this context, this paper ...
متن کاملGraph Partitioning Using Genetic Algorithms
The eecient implementation of parallel processing ar-chitectures generally requires the solution of hard combi-natorial problems involving allocation and scheduling of tasks. Such problems can often be modelled with considerable accuracy as a graph partitioning problem|a problem well-known from complexity theory to be NP-hard, which implies that for practical purposes the global optimum will no...
متن کاملSolving the Generalized Graph Search Problem with Genetic Algorithms
This paper describes a genetic algorithm for finding low-cost paths through connectivity graphs. The map search problem does not lend itself to implementation with genetic algorithms because it is difficult to define a physically meaningful crossover operator: combining half of one set of driving directions with half of another set will rarely result in meaningful instructions. A selective cros...
متن کاملExact Graph Search Algorithms for Generalized Traveling Salesman Path Problems
The Generalized Traveling Salesman Path Problem (GTSPP) involves finding the shortest path from a location s to a location t that passes through at least one location from each of a set of generalized location categories (e.g., gas stations, grocery stores). This NP-hard problem type has many applications in transportation and location-based services. We present two exact algorithms for solving...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2013
ISSN: 0362-1340,1558-1160
DOI: 10.1145/2517327.2442549